Adaptive Monte Carlo Variance Reduction with Two-time-scale Stochastic Approximation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Monte Carlo Variance Reduction with Two-time-scale Stochastic Approximation

Combined control variates and importance sampling variance reduction and its two-fold optimality are investigated. Two-time-scale stochastic approximation algorithm is applied in parameter search for the combination and almost sure convergence of the algorithm to the unique optimum is proved. The parameter search procedure is further incorporated into adaptive Monte Carlo simulation, and its la...

متن کامل

Adaptive Monte Carlo variance reduction for Lévy processes with two-time-scale stochastic approximation

We propose an approach to a two-fold optimal parameter search for a combined variance reduction technique of the control variates and the important sampling in a suitable pure-jump Lévy process framework. The parameter search procedure is based on the two-time-scale stochastic approximation algorithm with equilibrated control variates component and with quasi-static importance sampling one. We ...

متن کامل

Variance Reduction for Monte Carlo Implementation of Adaptive Sensor Management

Adaptive sensor management (scheduling) is usually formulated as a finite horizon POMDP and implemented using sequential Monte Carlo. In Monte Carlo, variance reduction is important for the reliable performance of the sensor scheduler. In this paper, we propose a Control Variate method for variance reduction when the sensor is scheduled using the Kullbach Leibler criterion.

متن کامل

Stochastic Variance-Reduced Hamilton Monte Carlo Methods

We propose a fast stochastic Hamilton Monte Carlo (HMC) method, for sampling from a smooth and strongly log-concave distribution. At the core of our proposed method is a variance reduction technique inspired by the recent advance in stochastic optimization. We show that, to achieve accuracy in 2-Wasserstein distance, our algorithm achieves Õ ( n+ κd/ + κdn/ 2/3 ) gradient complexity (i.e., numb...

متن کامل

Variance Reduction Techniques in Monte Carlo Methods

Monte Carlo methods are simulation algorithms to estimate a numerical quantity in a statistical model of a real system. These algorithms are executed by computer programs. Variance reduction techniques (VRT) are needed, even though computer speed has been increasing dramatically, ever since the introduction of computers. This increased computer power has stimulated simulation analysts to develo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monte Carlo Methods and Applications

سال: 2007

ISSN: 0929-9629,1569-3961

DOI: 10.1515/mcma.2007.010